Theory of computation - PDFSEARCH.IO - Document Search Engine

Theory of computation
Results: 2087

#	Item
11	Menu cs3102: Theory of Computation Class 21: Undecidability in Theory and Practice Exam 2: Out at end of class today, due Tuesday at 2:01pm Add to Reading List Source URL: www.cs.virginia.edu - Date: 2010-04-08 15:36:17
12	On the Lindell-Pinkas Secure Computation of Logarithms: From Theory to Practice Raphael S. Ryger∗ Onur Kardes† Add to Reading List Source URL: www.csee.umbc.edu - Date: 2008-02-15 00:34:08
13	PROGRAM EXTRACTION IN EXACT REAL ARITHMETIC KENJI MIYAMOTO AND HELMUT SCHWICHTENBERG Dedicated to John Tucker on occasion of his 60th birthday Abstract. The importance of an abstract approach to a computation theory over Add to Reading List Source URL: www.math.lmu.de - Date: 2013-01-18 04:56:23
14	Towards a Theory of Networked Computation Joan Feigenbaum Michael Mitzenmacher Add to Reading List Source URL: www.cs.yale.edu - Date: 2009-07-20 13:14:01
15	MCS 441 – Theory of Computation I Spring 2016 Problem Set 3 Lev Reyzin Due: at the beginning of class Add to Reading List Source URL: homepages.math.uic.edu - Date: 2016-02-15 14:41:46
16	TWISTED FORMS OF LINEAR ALGEBRAIC GROUPS: SOME ASPECTS OF COMPUTATION INTERCITY NUMBER THEORY SEMINAR. EINDHOVEN, NETHERLANDS SERGEI HALLER Add to Reading List Source URL: www.math.leidenuniv.nl - Date: 2004-11-02 09:29:39
17	Towards a Theory of Networked Computation Joan Feigenbaum Michael Mitzenmacher Add to Reading List Source URL: www.cs.yale.edu - Date: 2006-12-25 17:12:57
18	Logic, Computation and Constraint Satisfaction Barnaby D. Martin University of Leicester Add to Reading List Source URL: www.bedewell.com Language: English - Date: 2009-11-10 10:57:12 Computational complexity theory Logic Complexity classes Mathematical logic PSPACE FO Second-order logic P versus NP problem Constraint satisfaction problem NP P Constraint satisfaction
19	The complexity of positive first-order logic without equality II: The four-element case Barnaby Martin1? and Jos Martin2 1 School of Engineering and Computing Sciences, Durham University, Add to Reading List Source URL: www.bedewell.com Language: English - Date: 2010-06-03 07:34:14 Computational complexity theory Complexity classes Theory of computation FO PSPACE IP NP P Reduction Homomorphism SO
20	Approximating Border Length for DNA Microarray Synthesis Cindy Y. Li1 Prudence W.H. Wong1 Qin Xin2 Fencol C.C. Yung3 1 3 Add to Reading List Source URL: cgi.csc.liv.ac.uk Language: English - Date: 2008-03-23 11:43:26 Computational complexity theory Mathematics Dynamic programming Theory of computation IP Longest common subsequence problem

UPDATE